Multi-view subspace clustering networks with local and global graph information
نویسندگان
چکیده
This study investigates the problem of multi-view subspace clustering, goal which is to explore underlying grouping structure data collected from different fields or measurements. Since do not always comply with linear models in many real-world applications, most existing clustering methods based on shallow may fail practice. Furthermore, graph information usually ignored methods. To address aforementioned limitations, we proposed novel networks local and global information, termed MSCNLG, this paper. Specifically, autoencoder are employed multiple views achieve latent smooth representations that suitable for assumption. Simultaneously, by integrating fused into self-expressive layers, MSCNLG obtains common shared representation, can be used get results employing standard spectral algorithm. As an end-to-end trainable framework, method fully valuable views. Comprehensive experiments six benchmark datasets validate effectiveness superiority MSCNLG.
منابع مشابه
Multi-view Clustering with Adaptively Learned Graph
Multi-view clustering, which aims to improve the clustering performance by exploring the data’s multiple representations, has become an important research direction. Graph based methods have been widely studied and achieve promising performance for multi-view clustering. However, most existing multi-view graph based methods perform clustering on the fixed input graphs, and the results are depen...
متن کاملRobust Localized Multi-view Subspace Clustering
In multi-view clustering, different views may have different confidence levels when learning a consensus representation. Existing methods usually address this by assigning distinctive weights to different views. However, due to noisy nature of realworld applications, the confidence levels of samples in the same viewmay also vary. Thus considering a unified weight for a view may lead to suboptim...
متن کاملMulti-view low-rank sparse subspace clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...
متن کاملMulti-View Structural Local Subspace Tracking
In this paper, we propose a multi-view structural local subspace tracking algorithm based on sparse representation. We approximate the optimal state from three views: (1) the template view; (2) the PCA (principal component analysis) basis view; and (3) the target candidate view. Then we propose a unified objective function to integrate these three view problems together. The proposed model not ...
متن کاملClustering with Simultaneous Local and Global View of Data
ABSTRACT A good clustering algorithm should not only be able to discover clusters of arbitrary shapes (global view) but also provide additional information, which can be used to gain more meaningful insights into the internal structure of the clusters (local view). In this work we use the mathematical framework of factor graphs and message passing algorithms to optimize a pairwise similarity ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2021
ISSN: ['0925-2312', '1872-8286']
DOI: https://doi.org/10.1016/j.neucom.2021.03.115